Welcome![Sign In][Sign Up]
Location:
Search - node vector matlab

Search list

[matlabdeBoorCH

Description: de Boor 求值算法求作二次和三次B-样条插值曲线,Hartley-Judd法确定节点矢量,使用基于基的运算的插值法求控制顶点-algorithm evaluates demand for secondary and cubic B-spline interpolation curve, Hartley-Judd determine node vector-based computing interpolation method for the control vertices
Platform: | Size: 5120 | Author: jo Wang | Hits:

[Windows Developrk4

Description: function [tout, yout] = rk4(ypfun, tspan, y0, h) %定步长四阶Runge-Kutta法求常微分方程(组)数值解 %[tout,yout] = rk4( ypfun , tspan, y0,h) % 这里字符串ypfun是用以表示f(t, y)的M文件名, % tspan=[t0, tfinal]表示自变量初值t0和终值tf % y0表示初值向量y0,h是步长。 % 输出列向量tout表示节点 (t0 , t1 , … , tn) % 输出矩阵yout 表示数值解,每一列对应y的一个分量-function [tout, yout] = rk4 (ypfun. tspan, y0, h)% fixed step four-stage Runge- Kutta method for ordinary differential equations (Group) numerical solution% [tout. yout] = rk4 (ypfun, tspan, y0, h)% string ypfun here is used to indicate that f (t, y) M name, tspan% = [t0. tfinal] said variable initial and final t0 tf% y0 said initial vector y0, h is a step. % Output column vector tout said Node (t0, t1, ..., tn)% output matrix yout said numerical solution, each y counterparts out of a weight
Platform: | Size: 1024 | Author: 王志波 | Hits:

[AI-NN-PRMCRGSA

Description: MCRGSA------组播路由问题遗传模拟退火算法 %M-----------遗传算法进化代数 %N-----------种群规模,取偶数 %Pm----------变异概率调节参数 %K-----------同一温度下状态跳转次数 %t0----------初始温度 %alpha-------降温系数 %beta--------浓度均衡系数 %ROUTES------备选路径集 %Num---------到各节点的备选路径数目 %Cost--------费用邻接矩阵 %Source------源节点标号 %End---------目的节点标号组成的向量 %MBR---------各代最优路径编码-MCRGSA------ Multicast Routing genetic simulated annealing% M----------- genetic algorithm algebra% N----------- population size, even take Pm----------% probability parameter variation%----------- same temperature K Jump under a number of state----------% t0 initial temperature cooling% alpha------- beta coefficient%-------- balanced concentration coefficient% ROUTES------ Alternative Path Set% Enable--------- nodes to the number of alternative paths%-------- Cost adjacent costs Matrix% Source------ source node labeling% End--------- destination node labeling Group Vector%% of the MBR--------- generations optimal path coding
Platform: | Size: 1024 | Author: 程爱华 | Hits:

[Software EngineeringMatlabjiedianyouhua

Description: 将潮流计算公式矢量化处理,利用Matlab编写潮流程序,并将Matlab的m文件编译成COM组件,可简单实现 Matlab和其它语言的混合编程。通过简单的函数调用即可完成如稀疏、解方程等一系列数学运算,并可轻易实现相关图形的 绘制。潮流计算中采用AMD算法对修正方程系数矩阵进行节点优化,并采用LDLT算法进行求解,有效地减少了注入元,计 算速度成倍提高。在混合编程的模式下,提高了程序开发速度、程序可靠性、计算效率和保密性。 -Formula for calculating the trend vector processing, the use of Matlab procedures for the preparation of the tide, and Matlab m-file compiled into a COM component, can be simply the realization of Matlab and other programming languages mixed. Through a simple function call to complete, such as sparse, solve a series of mathematical equations, and easily achieve the related graphics rendering. Power flow calculation algorithm used in AMD coefficient matrix of the correction equation for node optimization, and the use of LDLT algorithm, effectively reduces injection yuan, doubling to improve computing speed. Programming in mixed mode, increased the speed of program development, program reliability, computational efficiency and confidentiality.
Platform: | Size: 222208 | Author: wuzhicheng | Hits:

[matlabEUCLIDEAN_Algorithm

Description: Euclidean节点定位是由美国路特葛斯大学利用距离矢量路由和GPS定位原理提供出一种分布式自主定位算法-Node localization Euclidean path by the Rutgers Universitys use of distance vector routing and GPS positioning to provide a principle of self-positioning algorithm for distributed
Platform: | Size: 1060864 | Author: qinhua | Hits:

[Internet-Networkdsdv

Description: ns2下dsdv实现代码。DSDV(Destination-Sequenced Distance-Vector)协议是先应式路由协议,是由传统的Bellman-Ford 路由协议改进得到的,其特点是利用目的节点序列号解决了DBF算法的路由环路和无穷计数问题。-dsdv the realization of the code under ns2. DSDV (Destination-Sequenced Distance-Vector) protocol is proactive routing protocol, is the traditional Bellman-Ford Routing Protocol has been improving, and its destination node is characterized by the use of the serial number of the DBF algorithm to solve the routing loop and count the issue of infinity.
Platform: | Size: 17408 | Author: 开开 | Hits:

[Otherlagrange

Description: 1.n个节点分段Lagrange插值多项式; 2.使用格式y=lagrange(x0,y0,x,k); 3.输入项x0为n维插值节点向量,y0为n维被插函数值向量; 4.x为m维插值点向量,k为分段插值多项式次数,不超过3,缺省为k=1; 5.输出y为插值点x处的函数值;- 1.n a sub-node Lagrange interpolation polynomial 2. The use of the format y = lagrange (x0, y0, x, k) 3. Input x0 of interpolation nodes for the n-dimensional vector, y0 for n-dimensional vector function to be inserted 4.x interpolation points for the m-dimensional vector, k is the number of sub-polynomial interpolation, not more than 3, the default for k = 1 5. output y for the interpolation points x Department of function
Platform: | Size: 1024 | Author: link | Hits:

[matlabdoolittle

Description: 1.n个节点分段Lagrange插值多项式; 2.使用格式y=lagrange(x0,y0,x,k); 3.输入项x0为n维插值节点向量,y0为n维被插函数值向量; 4.x为m维插值点向量,k为分段插值多项式次数,不超过3,缺省为k=1; 5.输出y为插值点x处的函数值;- 1.n a sub-node Lagrange interpolation polynomial 2. The use of the format y = lagrange (x0, y0, x, k) 3. Input x0 of interpolation nodes for the n-dimensional vector, y0 for n-dimensional vector function to be inserted 4.x interpolation points for the m-dimensional vector, k is the number of sub-polynomial interpolation, not more than 3, the default for k = 1 5. output y for the interpolation points x Department of function
Platform: | Size: 1024 | Author: link | Hits:

[matlabode45

Description: 解常微分方程的Matlab程序 字符串ypfun是用以表示f(t, y)的M文件名, tspan=[t0, tfinal]表示自变量初值t0和终值tf y0表示初值向量y0,可选参数options为用odeset设置精度等参数。 输出列向量tout表示节点,输出矩阵yout 表示数值解,每一列对应y的一个分量。若无输出参数,则作出图形。-Solution of ordinary differential equations of the Matlab program is used to indicate ypfun string f (t, y) M-file name, tspan = [t0, tfinal] said that since the variable t0 initial and final values of tf y0, said initial vector y0 , optional parameters to set options for the use of odeset accuracy and other parameters. The output column vector tout that node, the output matrix yout that of numerical analysis, each column corresponds to y of a component. If there are no output parameters, then make a graph.
Platform: | Size: 6144 | Author: jiajt | Hits:

[Algorithmmasplinehh

Description: 用途:三阶样条插值(一阶导数边界条件) 格式:m=maspline(x,y,dy0,dyn,xx), x为节点向量,y为数据, dy0,dyn为左右两端点的一阶导数如果xx缺省,则输出各节点的 的一阶导数值,,m为xx的三阶样条插值-Uses: third-order spline interpolation (first order derivative boundary condition) format: m = maspline (x, y, dy0, dyn, xx), x is the node vector, y for the data, dy0, dyn left and right ends of points a derivative, if xx default, then the output of each node of the of a first derivative values,, m for the third-order spline interpolation xx
Platform: | Size: 1024 | Author: huanhuan | Hits:

[AI-NN-PRTimeSeriesPredictionUsingSupportVectorRegressionNe

Description: 为了选择神经网络的最好结构以及增强模型的推广能力,提出一种自适应支持向量回归神经网络(SVR—NN)。SVR—NN 用支持向量回归(SVR)方法获得网络的初始结构和权值, 白适应地生 成网络隐层结点,然后用基于退火过程的鲁棒学习算法更新网络结点疹教和权 主。 SVR—NN有很 好的收敛性和鲁棒性,能抑制由于数据异常和参数选择不当所导致的“过拟合,’现象。将SVR—NN 应用到时间序列预测上。结果表明,SVR.NN预测模型能精确地预测混沌时间序列,具有很好的 理论和应用价值。-Abstract:To select the‘best’structure of the neural networks and enhance the generalization ability of models.a support vector regression neural networks fSVR-NN)was proposed.Firstly,support vector regression approach was applied to determine initial structure and initial weights of SVR.NN SO that the number of hidden layer nodes can be constructed adaptively based on support vectors.Furthermore,an annealing robust learning algorithm was further presented to fine tune the hidden node parameters and weights of SVR一ⅣM The adaptive SVR.NN has faSt convergence speed and robust capability.and it can also suppress the ‘orerfitting’phenomena when the train data ncludes outliers.The adaptive SVR.NN was then applied to time series prediction.Experimental results show that the adaptive SVR.ⅣⅣ can accurately predict chaotic time series,and it iS valuable in both theory and application aspects.
Platform: | Size: 316416 | Author: 11 | Hits:

[Mathimatics-Numerical algorithmsxiangliangfapf

Description: 用向量法求解电力网络潮流的matlab程序,包含IEEE14节点数据及计算结果-With the vector method to solve the trend of electric power network matlab program that contains the node data and calculation results IEEE14
Platform: | Size: 3072 | Author: dgd | Hits:

[matlabsom(Jal.You)

Description: SOM神经网络(自组织特征映射神经网络)是一种无导师神经网路。网络的拓扑结构是由一个输入层与一个输出层构成。输入层的节点数即为输入样本的维数,其中每一节点代表输入样本中的一个分量。输出层节点排列结构是二维阵列。输入层X中的每个节点均与输出层Y每个神经元节点通过一权值(权矢量为W)相连接,这样每个输出层节点均对应于一个连接权矢量。 自组织特征映射的基本原理是,当某类模式输入时,其输出层某一节点得到最大刺激而获胜,获胜节点周围的一些节点因侧向作用也受到较大刺激。这时网络进行一次学习操作,获胜节点及其周围节点的连接权矢量向输入模式的方向作相应的修正。当输入模式类别发生变化时,二维平面上的获胜节点也从原来节点转移到其它节点。这样,网络通过自组织方式用大量训练样本数据来调整网络的连接权值,最后使得网络输出层特征图能够反映样本数据的分布情况。根据SOM网络的输出状况,不仅能判断输入模式所属的类别,使输出节点代表某类模式,而且能够得到整个数据区域的分布情况,即从样本数据得到所有数据的分布特征。 -SOM neural network (self-organizing feature map neural network) is an unsupervised neural network. Network topology is an input layer and an output layer. Input layer nodes is the input dimension of the sample, each node represents a component input samples. Output layer nodes are arranged in two-dimensional array structure. X in the input layer and output layer each node of each neuron node Y by a weight (the weight vector as W) is connected, so that each output layer corresponds to a connection node of the right vector. Self-organizing feature maps of the basic principle is, when each category of inputs into the model, its output layer one node get the maximum boost and win, Huoshengjiedian around Yixiejiedian Yin Zuo Yong Ye Shoudaojiaotai lateral stimulation. Then a learning network operation, the winner node and surrounding nodes in the right direction vector to the input mode to make consequential amendments. When the input mode type changes, the two-dimensional plane of the wi
Platform: | Size: 47104 | Author: leidan | Hits:

[matlabNew-WinRAR-ZIP-archive

Description: Bellman-Ford Shortest Path Algorithm (C) 2004 by Yu Hen Hu find shortest path from a fixed point U to any node V clear all n=input( Total number of nodes = ) echo on starting from a fixed point U, you enter the weight to each node as the weight on the edge from U to that node V if there is no such edge, enter inf when enter a vector, put all number within brackets [ ] echo o-Bellman-Ford Shortest Path Algorithm (C) 2004 by Yu Hen Hu find shortest path from a fixed point U to any node V clear all n=input( Total number of nodes = ) echo on starting from a fixed point U, you enter the weight to each node as the weight on the edge from U to that node V if there is no such edge, enter inf when enter a vector, put all number within brackets [ ] echo off
Platform: | Size: 1024 | Author: vahid | Hits:

[matlabtides

Description: T_XTIDE Tidal prediction YOUT=T_XTIDE(STATION) makes a tidal prediction for the current day using the harmonics file XTIDE. Predictions at other times can be generated using [...]=T_XTIDE(STATION,TIM) where TIM is a vector of matlab-format decimal days ( DATENUM). If TIM is a scalar then it is taken as the number of days present over which to make predictions. If TIM>1000 then it is taken to be the starting time in matlab-format. at the matlab time JD (UTC, but see code for details) where tau = lunar time s = mean longitude of the moon h = mean longitude of the sun p = mean longitude of the lunar perigee np = negative of the longitude of the mean ascending node pp = mean longitude of the perihelion (solar perigee) - T_XTIDE Tidal prediction YOUT=T_XTIDE(STATION) makes a tidal prediction for the current day using the harmonics file XTIDE. Predictions at other times can be generated using [...]=T_XTIDE(STATION,TIM) where TIM is a vector of matlab-format decimal days ( DATENUM). If TIM is a scalar then it is taken as the number of days present over which to make predictions. If TIM>1000 then it is taken to be the starting time in matlab-format. at the matlab time JD (UTC, but see code for details) where tau = lunar time s = mean longitude of the moon h = mean longitude of the sun p = mean longitude of the lunar perigee np = negative of the longitude of the mean ascending node pp = mean longitude of the perihelion (solar perigee)
Platform: | Size: 17408 | Author: yadan | Hits:

[Other Embeded programyouxianyuan

Description: 有限元方法matlab程序求节点位移向量-FEM node displacement vector matlab program seeking
Platform: | Size: 1024 | Author: 马童鞋 | Hits:

[matlabFEM_PROJECT

Description: fem2d_project读取定义采样一个文件(标量或矢量)函数的3个参数,以及一个节点和四面体元素的列表用于数据的有限元表示的 计算与之相关联的一组有限元系数给定的有限元素网格,并将该信息写入文件。 使有限元表示由节点、元素和值构成的文件。(FEM2D_PROJECT reads files defining a sampling of a (scalar or vector) function of 3 arguments, and a list of nodes and tetrahedral elements to use for a finite element representation of the data. It computes a set of finite element coefficients to be associated with the given finite element mesh, and writes that information to a file so that an FEM representation is formed by the node, element and value files.)
Platform: | Size: 29696 | Author: Littlestar | Hits:

CodeBus www.codebus.net